Logic, languages and linguistics
نویسندگان
چکیده
The talk includes: ¯ a brief survey of the literature on descriptive complexity results; this journey takes us from regular to context-sensitive languages, ¯ a brief survey of the complexity of (realistic) linguistic formalisms; this journey takes us from context-sensitive grammars to fragments of richer grammars, ¯ a discussion of generative and model-theoretic means to arrive at more adequate formalisms. My point of departure is the somewhat Chomskyan methodological point that an adequate theory of natural languages lies at the intersection of the descriptively adequate theories (in terms of extension), those theories that are adequate in terms of complexity and those theories that are adequate in terms of learnability. I talk mostly about complexity issues here.
منابع مشابه
Iranian Language Teachers’ Passion for the Profession: A Qualitative Study
To explore Iranian professionally developed English teachers’ passion for the English language teaching profession, an interview with 7 open-ended questions was conducted to 14 Iranian professionally developed teachers to discover what factors were at work in their professional growth. Participants included 8 Ph.D. holders, 3 Ph.D. candidates, and 3 M.A. holders in TEFL who had more than 20 yea...
متن کاملLive Graphical Computing Logic, Virtual Trees, and Visualization
The paper is a preliminary overview to a virtual tree computing logic with applications to Virtual Reality. Meta-contextual logic is combined with Morph Gentzen, a new computing logic the author presented in 1997. It has applications towards Virtual RealityVR computing since the trees on the languages can carry visual structures via functions. Designated functions define agents, as specific fun...
متن کاملLFP A Logic for Linguistic Descriptions and an Analysis of its Complexity
We investigate the weak expressive power of a notation using first-order logic, augmented with a facility for recursion, to give linguistic descriptions. The notation is precise and easy to read, using ordinary conventions of logic. Two versions of the notation are presented. One, called CLFP, speaks about strings and concatenation, and generates the class EXPTIME of languages accepted by Turin...
متن کاملModel Theoretic Syntax and Transitive Closure Logic
One of the most productive interactions between logic and computational linguistics in the last decade has been model theoretic syntax, a research program initiated by Rogers [8]. As a number of grammar formalisms proposed in linguistics and natural language processing are formulated as well-formedness conditions on trees, Rogers observed that the majority of these constraints can be expressed ...
متن کاملJALDA's Interview with Peter Mühlhäusler
Peter Mühlhäusler is the Foundation Professor of Linguistics at the University of Adelaide, and Supernumerary Fellow of Linacre College, Oxford. He has taught at the Technical University of Berlin and in the University of Oxford. He is an active researcher in several areas of linguistics, including ecolinguistics, language planning, and language policy and language contact in the Australian-Pac...
متن کاملFirst-order logic - Wikipedia, the free encyclopedia
First-order logic (FOL) is a formal deductive system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first-order predicate calculus (FOPC), the lower predicate calculus, the language of first-order logic or predicate logic. Unlike natural languages such as English, FOL uses a wholly unambiguous formal language interpreted by mathematical str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006